Enumerating coloured partitions in 2 and 3 dimensions

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Large 2-Coloured Matchings in 3-Coloured Complete Hypergraphs

We prove the generalized Ramsey-type result on large 2-coloured matchings in a 3-coloured complete 3-uniform hypergraph, supporting a conjecture by A. Gyárfás.

متن کامل

Enumerating Consecutive and Nested Partitions for Graphs

Consecutive and nested partitions have been extensively studied in the set-partition problem as tools with which to search efficiently for an optimal partition. We extend the study of consecutive and nested partitions on a set of integers to the vertex-set of a graph. A subset of vertices is considered consecutive if the subgraph induced by the subset is connected. In this sense the partition p...

متن کامل

Enumerating Extreme Points in Higher Dimensions

We consider the problem of enumerating all extreme points of a given set P of n points in d dimensions. We present an algorithm with O(n) space and O(nm) time where m is the number of extreme points of P. We also present an algorithm to compute the depth of each point of the given set of n points in d-dimensions. This algorithm has complexity O(n 2) which signiicantly improves the O(n 3) comple...

متن کامل

Enumerating finite set partitions according to the number of connectors

Let P (n, k) denote the set of partitions of [n] = {1, 2, . . . , n} containing exactly k blocks. Given a partition Π = B1/B2/ · · · /Bk ∈ P (n, k) in which the blocks are listed in increasing order of their least elements, let π = π1π2 · · · πn denote the canonical sequential form wherein j ∈ Bπj for all j ∈ [n]. In this paper, we supply an explicit formula for the generating function which co...

متن کامل

On 3-coloured tournaments

We (re-)prove that in every 3-edge-coloured tournament in which no vertex is incident with all colours there is either a cyclic rainbow triangle or a vertex dominating every other vertex monochromatically.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematical Proceedings of the Cambridge Philosophical Society

سال: 2019

ISSN: 0305-0041,1469-8064

DOI: 10.1017/s0305004119000252